The nonnegative P_0-matrix completion problem
نویسندگان
چکیده
منابع مشابه
The nonnegative Q − matrix completion problem
In this paper, the nonnegative Q-matrix completion problem is studied. A real n × n matrix is a Q-matrix if for k ∈ {1, . . . , n}, the sum of all k × k principal minors is positive. A digraph D is said to have nonnegative Q-completion if every partial nonnegative Q-matrix specifying D can be completed to a nonnegative Q-matrix. For nonnegative Q-completion problem, necessary conditions and suf...
متن کاملThe Q-matrix completion problem
Abstract. A real n × n matrix is a Q-matrix if for every k = 1, 2, . . . , n the sum of all k × k principal minors is positive. A digraph D is said to have Q-completion if every partial Q-matrix specifying D can be completed to a Q-matrix. For the Q-completion problem, sufficient conditions for a digraph to have Q-completion are given, necessary conditions for a digraph to have Q-completion are...
متن کاملThe Nonsingular Matrix Completion Problem
An n × n matrix is called a principally nonsingular matrix (NSmatrix) if all its principal minors are different from zero and it is called a totally nonsingular matrix (TNS-matrix) if all its minors are different from zero. In this paper, we are interested in the NS-matrix (TNSmatrix) completion problem: whether a partial NS-matrix (TNS-matrix) has a NS-matrix (TNS-matrix) completion. Here, we ...
متن کاملThe CP-Matrix Completion Problem
A symmetric matrix A is completely positive (CP) if there exists an entrywise nonnegative matrix B such that A = BB . We characterize the interior of the CP cone. We formulate the problem as linear optimizations with cones of moments. A semidefinite algorithm is proposed for checking interiors of the CP cone, and its properties are studied. A CP-decomposition of a matrix in Dickinson’s form can...
متن کاملAn Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries of a nonnegative matrix M so that XY approximates M . This problem is closely related to the two existing problems: nonnegative matrix factorization and low-rank matrix completion, in the sense that it kills two birds w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2003
ISSN: 1081-3810
DOI: 10.13001/1081-3810.1095